Test Translation for Embedded Finite State Machine Components
نویسندگان
چکیده
منابع مشابه
A Finite-State Approach to Machine Translation
The problem of machine translation can be viewed as consisting of two subproblems (a) Lexical Selection and (b) Lexical Reordering. We propose stochas-tic nite-state models for these two subproblems in this paper. Stochastic nite-state models are ee-ciently learnable from data, eeective for decoding and are associated with a calculus for composing models which allows for tight integration of co...
متن کاملFinite-state transducer inference for a spee machine translation
Statistical techniques and grammatical inference have been used for dealing with automatic speech recognition with success, and can also be used for speech-to-speech machine translation. In this paper, new advances on a method for finite-state transducer inference are presented. This method has been tested experimentally in a speech-input translation task using a recognizer that allows a flexib...
متن کاملTest Suite Minimization for Embedded Nondeterministic Finite State Machines
This paper presents a method for minimizing test suites for embedded, nondeterministic Finite State Machines. The method preserves the fault coverage of the original test suite, and can be used in conjunction with any technique for generating test suites. The minimization is achieved by detecting and deleting redundant test cases in the test suite. The proposed method is an extension of the wor...
متن کاملFlexible finite-state lexical selection for rule-based machine translation
In this paper we describe a module (rule formalism, rule compiler and rule processor) designed to provide flexible support for lexical selection in rule-based machine translation. The motivation and implementation for the system is outlined and an efficient algorithm to compute the best coverage of lexical-selection rules over an ambiguous input sentence is described. We provide a demonstration...
متن کاملTimer Embedded Finite State Machine Modeling And Its Application
In this paper, we propose an extension of classical finite state machine as it called a timer embedded finite state machine (TEFSM) with its formal modeling methods. In the proposed state-based approach, a discrete event system is modeled as a coupled TEFSM. Also presented is a systematic procedure and architecture of developing a simulation executor with a synchronization manager for the coupl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Computer Journal
سال: 2016
ISSN: 0010-4620,1460-2067
DOI: 10.1093/comjnl/bxw028